Koblitz Curves and its practical uses in Bitcoin security
نویسنده
چکیده
Koblitz curves are a type of elliptic curves characterized by its non-random construction which allows for especially efficient computation. This is different from the most commonly used elliptic curves that have a pseudo-random structure where the parameters are chosen by a specified algorithm. With the rise of online cryptocurrency we are seeing practical uses and implementations of Koblitz curves in the exchange and ownership of cryptocurrency. Bitcoin uses a specific Koblitz curve secp256k1 defined by the Standards for Efficient Cryptography Group (SECG). The curve is defined over the finite field Fp : y = x + ax + b With a = 0, b = 7 In my project I plan to introduce Koblitz curves and look at its advantagesor disadvantages in comparison to normal pseudo-random curves. I want to ex-plore the different defined Koblitz curves from SECG and see why the specificcurve secp256k1 was chosen by the creator of Bitcoin. I also want to give anoverview of how the Bitcoin protocol uses Koblitz curves to ensure security insigning and transferring funds. References[1] Standards for Efficient Cryptography SEC 2: Recommended Elliptic CurveDomain Parameters January 27, 2010 [http://www.secg.org/sec2-v2.pdf].[2] Jerome A. Solinas Efficient Arithmetic on Koblitz Curves National SecurityAgency, Ft. Meade. March 2000.
منابع مشابه
Lightweight Coprocessor for Koblitz Curves: 283-Bit ECC Including Scalar Conversion with only 4300 Gates
We propose a lightweight coprocessor for 16-bit microcontrollers that implements high security elliptic curve cryptography. It uses a 283-bit Koblitz curve and offers 140-bit security. Koblitz curves offer fast point multiplications if the scalars are given as specific τ -adic expansions, which results in a need for conversions between integers and τ -adic expansions. We propose the first light...
متن کاملFast point multiplication on Koblitz curves: Parallelization method and implementations
Point multiplication is required in every elliptic curve cryptosystem and its efficient implementation is essential. Koblitz curves are a family of curves defined over F2m allowing notably faster computation. We discuss implementation of point multiplication on Koblitz curves with parallel field multipliers. We present a novel parallelization method utilizing point operation interleaving. FPGA ...
متن کاملPoint compression for Koblitz elliptic curves
Elliptic curves over finite fields have applications in public key cryptography. A Koblitz curve is an elliptic curve E over F2; the group E(F2n ) has convenient features for efficient implementation of elliptic curve cryptography. Wiener and Zuccherato and Gallant, Lambert and Vanstone showed that one can accelerate the Pollard rho algorithm for the discrete logarithm problem on Koblitz curves...
متن کاملA Frobenius Map Approach for an Efficient and Secure Multiplication on Koblitz
The most efficient technique for protecting the using Frobenius algorithms for scalar multiplication on Koblitz curves against the Side Channel Attacks seems to be the multiplier randomization technique proposed by Joye and Tymen. In this paper, an heuristic analysis on the security of the Joye and Tymen’s technique is given. A new method improving this technique is proposed. Analysis shows tha...
متن کاملPower Analysis Attacks and Algorithmic Approaches to their Countermeasures for Koblitz Curve Cryptosystems
Because of their shorter key sizes, cryptosystems based on elliptic curves are being increasingly used in practical applications. A special class of elliptic curves, namely, Koblitz curves, offers an additional but crucial advantage of considerably reduced processing time. In this article, power analysis attacks are applied to cryptosystems that use scalar multiplication on Koblitz curves. Both...
متن کامل